Solving Updated Systems of Linear Equations in Parallel ?

نویسنده

  • P. Blaznik
چکیده

In this paper, updating algorithms for solving linear systems of equations are presented using a systolic array model. First, a parallel algorithm for computing the inverse of rank-one modiied matrix using the Sherman-Morrison formula is proposed. This algorithm is then extended to solving the updated systems of linear equations on a linear systolic array. Finally, the generalisation to the updates of higher rank is shown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes

In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...

متن کامل

Resolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method

The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...

متن کامل

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

Jacobi Operational Matrix Approach for Solving Systems of Linear and Nonlinear Integro-Differential Equations

‎‎‎‎‎‎‎‎‎‎‎‎‎This paper aims to construct a general formulation for the shifted Jacobi operational matrices of integration and product‎. ‎The main aim is to generalize the Jacobi integral and product operational matrices to the solving system of Fredholm and Volterra integro--differential equations‎ which appear in various fields of science such as physics and engineering. ‎The Operational matr...

متن کامل

SsT decomposition method for solving fully fuzzy linear systems

The SST decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. In this topic we are going to consider vectors as fuzzy vectors. We have considered a numerical example and tried to find out solution vector x in fuzzified form using method of SST decomposition.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995